-
1 node merging
-
2 node merging
Большой англо-русский и русско-английский словарь > node merging
-
3 node merging
1) Механика: слияние узлов2) Робототехника: слияние узлов (графа) -
4 node merging
-
5 node merging
English-Russian dictionary of computer science and programming > node merging
-
6 node merging
-
7 node merging
Англо-русский словарь промышленной и научной лексики > node merging
-
8 merging
1. поглощение2. соединение, слияниеcopy merging — соединение сюжетов; соединение оригиналов
3. соединение лент4. слияние информации, закодированной на различных лентах -
9 node
1. n книжн. узел, узловая точка; пункт, центр переплетения или пересечения2. n книжн. завязка3. n книжн. астр. узел; точка пересечения орбит4. n книжн. филос. узловой пункт5. n книжн. мед. нарост, утолщение, выпуклость6. n книжн. вчт. вершинаleaf node — краевой узел; концевая вершина; лист
Синонимический ряд:bump (noun) bump; lump; nodule; protuberance; swelling -
10 merging
1. сливание; растворение; поглощение2. объединять; слияниеСинонимический ряд:1. unification (noun) coadunation; coalition; combination; consolidation; melding; mergence; merger; unification; union2. mixing (verb) admixing; amalgamating; blending; combining; commingling; compounding; fusing; immixing; intermingling; intermixing; making up; melding; mingling; mixing; stirring -
11 merging
сливающий; слияние; совместный -
12 node
-
13 merging
слияние, объединениеEnglish-Russian dictionary of computer science and programming > merging
-
14 merging node
объединенный узел
Узел, в состав которого входит несколько территориально разнесенных узлов с общей системой управления.
[Л.М. Невдяев. Телекоммуникационные технологии. Англо-русский толковый словарь-справочник. Под редакцией Ю.М. Горностаева. Москва, 2002]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > merging node
-
15 ordering by merging
-
16 sequence by merging
-
17 blob merging
-
18 edge merging
-
19 line merging
-
20 region merging
- 1
- 2
См. также в других словарях:
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Leftist tree — A leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node has an s value which is the distance to the nearest leaf. In contrast to a binary heap , a leftist tree attempts to be very unbalanced. In… … Wikipedia
Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia
Binomial heap — In computer science, a binomial heap is a heap similar to a binary heap but also supporting the operation of merging two heaps quickly. This is achieved by using a special tree structure. It is important as an implementation of the mergeable heap … Wikipedia
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… … Wikipedia
Proto-Germanic language — Proto Germanic Spoken in Northern Europe Extinct evolved into Proto Norse, Gothic, Frankish and Ingvaeonic by the 4th century Language family Indo European … Wikipedia
Binary heap — Example of a complete binary max heap Example of a complete binary min heap A binary … Wikipedia
Cobweb (clustering) — COBWEB is an incremental system for hierarchical conceptual clustering. COBWEB incrementally organizes observations into a classification tree. Each node in a classification tree represents a class (concept) and is labeled by a probabilistic… … Wikipedia
Borg (Star Trek) — The Borg A Borg insignia, designed by Rick Sternbach (first appeared in the episode Q Who)[n 1] Founded Before the 15th century Base of operations Delta Quadrant … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia